Enforcing access structures in fully homomorphic encryption

ABSTRACT

A homomorphic encryption system receives a ciphertext output of an arithmetic evaluation function. The arithmetic evaluation function is performed on a ciphertext input homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property. The ciphertext output is decrypted using a summation of two or more noise-canceling party identifiers of two or more authorized parties, wherein the intersection property of the sets cancels out errors generated during the decrypting operation for the two or more authorized parties.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is related by subject matter to U.S. application Ser. No. ______ [Docket No. 075236], filed concurrently herewith and entitled “Fully Homomorphic Encryption from Error Canceling Set-Systems,” which is specifically incorporated by reference for all that it discloses and teaches.

SUMMARY

The described technology provides methods and systems for homomorphic encryption, including receiving a ciphertext output of an arithmetic evaluation function. The arithmetic evaluation function is performed on a ciphertext input homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property. The ciphertext output is decrypted using a summation of two or more noise-canceling party identifiers of two or more authorized parties, wherein the intersection property of the sets cancels out errors generated during the decrypting operation for the two or more authorized parties.

This summary is provided to introduce a selection of concepts in a simplified form that is further described below in the Detailed Description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.

Other implementations are also described and recited herein.

BRIEF DESCRIPTIONS OF THE DRAWINGS

FIG. 1 illustrates an example fully homomorphic encryption system.

FIG. 2 illustrates an example flow through a homomorphic evaluation circuit.

FIG. 3 illustrates example components used in a fully homomorphic encryption system.

FIG. 4 illustrates example operations for evaluating homomorphically encrypted ciphertext.

FIG. 5 illustrates example operations for decrypting homomorphically encrypted ciphertext.

FIG. 6 illustrates an example computing device for implementing the features and operations of the described technology.

DETAILED DESCRIPTIONS

Homomorphic encryption allows certain computations on encrypted data (i.e., ciphertexts generated from plaintext data) to generate an encrypted result that, when decrypted, matches the result of the same operations performed on the plaintext data. Homomorphic encryption can be applied to computations that are known and relatively simple (e.g., a limited number of additions and multiplications). For example, a data owner wishes to send data to the cloud for computation but does not trust the cloud service provider with the data. Using a homomorphic encryption scheme, the data owner can encrypt the data and send it to the cloud service, which performs the computations on the data without decrypting it and sends the encrypted results back to the data owner. The data owner can then decrypt the encrypted results to access the plaintext results. In some implementations, the encrypted results may be decrypted by an authorized subset of collaborating parties according to an enforced access structure.

Fully Homomorphic Encryption (FHE) refers to homomorphic encryption schemes that allow an unbounded number of addition and multiplication operations over the encrypted data. Generally, adding ciphertexts together adds a small error (sometimes referred to as “noise”) to the computational results. In contrast, multiplying ciphertexts together tends to introduce greater error in the computational results during evaluation. Limiting, diminishing, or eliminating the error from the evaluation result may involve constraining the number and types of operations performed, bootstrapping, or some other supplemental error-removal operations (which can significantly decrease the performance of the evaluation), etc.

As an alternative, a set-system may be selected that includes sets having an intersection property that cancels out the error during the evaluation, rather than by constraining the operation or performing supplemental error-removal operations. This approach dramatically improves the performance of the evaluation. Vectors may be selected from a covering vector family that represents the set-system, such that the inner product of the vectors equals a multiple of a chosen non-prime integer when the size of the intersection of the sets represented by the two vectors is a multiple of the non-prime integer. The vectors may be used to homomorphically encrypt plaintext into ciphertext input for the evaluation. Errors generated during the evaluation are then canceled out based on the intersection properties of the set-system used to encrypt the ciphertext input.

FIG. 1 illustrates an example fully homomorphic encryption system 100. Plaintext input 102, which may be encoded from raw input data, is received through a communications interface of an encryption operator configured to perform a homomorphic encryption 104 process based on a set-system having an intersection property. In one implementation, the intersection property is characterized by two vectors of a covering vector family of the set-system that have an inner product equal to a multiple of a chosen non-prime integer when the size of the intersection of the sets represented by the two vectors is a multiple of the non-prime integer. The result of the homomorphic encryption 104 is output via the communications interface of the encryption operator as ciphertext input 106.

In one implementation, the homomorphic encryption 104 can be described as follows. A vector v

is sampled from the covering vector family

such that the set H∈

represented by v has s^(l−1) proper supersets in

. Recall that s is superpolynomial w.r.t. h and r. An error E is randomly sampled from a cyclic generator set ℑ for module M, which is used to define the CLWE distribution. Party P_(b) (b∈{0,1}) is provided with {E, A₀, A, x_(b)}, where x_(b)=

v,v_(b)

for some v_(b)∈

such that H_(b)

H and H

H_(b). Pick an integer q such that m=lφ(q) and l²φ(q)=q. Party P_(b) encrypts its plaintext S_(b)∈ℑ and generates addition compatible ciphertext as: C_(a) ^((b))=AS_(b)+

v,v_(b)

E mod q. Party P₀ generates multiplication compatible ciphertext C_(d) ⁽⁰⁾ as: C_(d) ⁽⁰⁾A₀=AS₀+

mod q, and party P₁ generates its multiplication compatible ciphertext as: C_(d) ⁽¹⁾A=A₀S₁+

mod q. C_(d) ^((b)) can be computed via lattice trapdoors.

The ciphertext input 106 is provided to a homomorphic evaluation circuit 108 having one or more multiplicative gates and/or additive gates in the homomorphic evaluation circuit 108. Each level in the homomorphic evaluation circuit 108 has one matrix assigned to it. A is the level 0 matrix. The matrices for all other levels alternate between A and A₀. Addition of any two addition compatible ciphertexts is straightforward via simple addition, yielding a result that depends upon the choice of v₀ and v₁. Multiplication of two compatible ciphertexts can be performed as:

$\begin{matrix} {{C_{d}^{(1)}C_{d}^{(0)}A_{0}} = {{C_{d}^{(1)}\left( {{AS_{0}} + E^{\langle{v,v_{0}}\rangle}} \right)}{{mod}q}}} \\ {= {{C_{d}^{(1)}AS_{0}} + {C_{d}^{(1)}E^{\langle{v,v_{0}}\rangle}{{mod}q}}}} \\ {= {{A_{0}S_{1}S_{0}} + {E^{\langle{v,v_{1}}\rangle}S_{0}} + {C_{d}^{(1)}E^{\langle{v,v_{0}}\rangle}{{{mod}q}.}}}} \end{matrix}$

Since ℑ is cyclic, the “nature” of the errors remains preserved throughout the multiplication. If S₀=

for some randomly sampled v_(z)∈

, then the errors get reduced in the desired manner.

The result of the evaluation is output as homomorphically encrypted ciphertext output 110, which is received through a communication interface of a decryption operator configured to perform a homomorphic decryption 112 process to yield the plaintext output 114 of the evaluation. The plaintext output 114 may also be output via the communication interface. Accordingly, the ciphertext input 106 can be evaluated against an arithmetic function without the ciphertext input 106, the ciphertext output 110, and any intermediate ciphertext being decrypted by the evaluating process. In some implementations, the encrypted results (the ciphertext output 110) may be decrypted by an authorized subset of collaborating parties according to an enforced access structure.

The description provided herein relies on certain notations and concepts listed below:

-   -   : set of all integers,     -   : set of all rational numbers,     -   : set of all real numbers.

Definition 1 (Hadamard/Schur product)—The Hadamard/Schur product of two vectors u,v∈

^(n) denoted by u∘v returns a vector in the same linear space whose i-th element is defined as: (u∘v)[i]=u[i]·v[i], for all∈[n].

Definition 2 (Negligible Function)—For a security parameter, ω, a function∈(ω) is called negligible if, for all c>0, there exists a ω₀ such that

${\epsilon(\omega)} < \frac{1}{\omega^{c}}$

for all ω>ω₀.

Theorem 3 (Euler's Theorem)—Let y be a positive integer and

*_(y) denote the multiplicative group mod y. Then, for every integer c that is coprime to y, it holds that: c^(φ(y))=1 mod y, where φ(y)=|

*_(y)| denotes Euler's totient function.

Definition 4 (Access Structures)—Let

={P₁, . . . ,

} be a set of parties. A collection Γ⊆

is monotone if

∈Γ and

⊆

imply that

∈Γ. An access structure Γ⊆

is a monotone collection of non-empty subsets of

. Sets in Γ are designated as “authorized,” and sets not in Γ are designated as “unauthorized.”

If Γ consists of all subsets of

with size greater than or equal to a fixed threshold t, where (1≤t≤

), then Γ is called a t-threshold access structure.

Definition 5 (Minimal Authorized Subset)—For an access structure Γ, a family of minimal authorized subsets Γ₀∈Γ is defined as:

Γ₀={

∈Γ:

for all

∈Γ\{

}}

Hence, the family of minimal access subsets Γ₀ uniquely determines the access structure Γ, and it holds that: Γ=cl(Γ₀), where cl denotes closure.

Learning with errors (LWE) denotes the computational problem of inferring a linear n-ary function ƒ over a finite ring from given samples y_(i)=ƒ(x_(i)), some of which may be erroneous. Hence, the LWE problem involves recovery of a secret s given a sequence of approximate random linear equations on it. LWE is hard to solve based on certain assumptions regarding the worst-case hardness of lattice problems, such as GapSVP (a decision version of the Shortest Vector Problem) and SIVP (Shortest Independent Vectors Problem). In group theory, a lattice in

^(n) is a subgroup of the additive group

^(n), which is isomorphic to the additive group

^(n) and spans the real vector space

^(n). Accordingly, for any basis of

^(n), the subgroup of all linear combinations with integer coefficients of the basis vectors forms a lattice.

Definition 6 (Decision-LWE)—For positive integers n and p≥2, and an error (probability) distribution χ over

, the decision-LWE_(n,q,χ) problem is to distinguish between the following pairs of distributions:

((a _(i) ,

a _(i) ,s

+e _(i)))_(i) and ((a _(i) ,u _(i))_(i),

where i∈[poly(n)], a_(i)

_(q) ^(n), s

_(q) ^(n), e_(i)

χ, and u_(i)

_(q).

For a certain noise distribution χ and a sufficiently large q, the LWE problem is as hard as the worst-case SIVP and GapSVP under a quantum reduction. This conclusion has been extended to show that s can be sampled from a low norm distribution (in particular, from the noise distribution χ), and the resulting problem is as hard as the basic LWE problem. Similarly, the noise distribution χ can be a simple low-norm distribution. Therefore, a standard hybrid argument naturally leads to the multi-secret form of LWE, which is to distinguish:

(A,B=AS+E) and (A,U),

where A

_(q) ^(m×n), S

χ^(n×m), E∈χ^(m×n) and U

U for a uniform distribution U over

_(q) ^(m×n). It can be verified that up to an m factor loss in the distinguishing advantage, multi-secret LWE is equivalent to plain (single-secret) decision-LWE.

A lattice trapdoor function presents a mechanism for constructing ciphertext secure public-key encryption (PKE) schemes from lattice assumptions.

Definition 7—Let n≥wd be an integer and n=n−wd. For A∈

_(q) ^(w×n), we say that R∈

_(q) ^(n×wd) is a trapdoor for A with tag H∈

_(q) ^(w×w) if

${{A\begin{bmatrix} R \\ I \end{bmatrix}} = {H \cdot G}},$

where G∈

_(q) ^(w×wd) is a primitive matrix.

Given a trapdoor R for A, and an LWE instance B=AS+E mod q for some “short” error matrix E, the LWE inversion algorithm successfully recovers S (and E) with overwhelming probability.

Learning with Errors From Cyclic Algebras (CLWE) is provided based on the following:

Definition 8 (Cyclic Galois extension)—A cyclic Galois extension L/K is defined as a Galois extension such that the Galois group of L over K is the cyclic group generated by some element θ of degree d:=[L:K].

Definition 9 (CLWE distribution)—Let L/K be a Galois extension of number fields of degree [L:K]=d,[K:

]=n with cyclic Galois group generated by θ(⋅). Let

:=(L/K,θ,γ) be the resulting cyclic algebra with center K and invariant u with u^(d)=γ∈

_(K), where

_(K) represents the ring of integers over number field K. Let Λ be an order of

. For an error distribution ψ over ⊕_(i=1) ^(d−1)u^(i)

, an integer modulus q≥2, and a secret s∈Λ_(q) ^(∨) (Λ_(q) ^(∨) denotes the codifferent ideal, modulo q, for order Λ), a sample from the CLWE distribution Π_(s,q,ψ) is obtained by sampling a

Λ_(q), e←ψ and outputting

$\left( {a,b} \right) = {\left( {a,{\frac{a \cdot s}{q} + {e\mspace{14mu}{mod}\mspace{14mu}\Lambda^{\bigvee}}}} \right) \in {\left( {\Lambda_{q},{\oplus_{i = 1}^{d - 1}{u^{i}L_{\mathbb{R}}}}} \right)/{\Lambda^{\bigvee}.}}}$

Definition 10 (Decision-CLWE)—Let Υ be some distribution on a family of errors distributions over ⊕_(i=1) ^(d−1)u^(i)

and U_(Λ) denote the uniform distribution on (Λ_(q), (⊕_(i=1) ^(d−1)u^(i)

)/Λ^(∨)). Then, for (s,ψ)←U(Λ_(q) ^(∨))×Υ, the decision CLWE problem is to distinguish distribution Π_(s,q,ψ) from U_(Λ).

Based on the previously-described foundation, fully homomorphic encryption via error canceling set-systems can be provided using tools in the forms of a predefined set-system and a vector family that follows from it. Constructions for both of these tools are provided below.

A superpolynomial size set-system

is described first.

Definition 11—A family of sets {G₁, G₂, . . . , G_(t)} is non-degenerate if for all 1≤i≤t, there exists 1≤j≤t such that: G_(i)

G₁.

Definition 12—Let m≥2, t≥2 be integers and

be a set-system. We shall say that

has t-wise restricted intersections modulo m if the following two conditions hold:

-   -   1. ∀H∈         , |H|32 0 mod m,     -   2. ∀t′ satisfying 2≤t′≥t, and ∀H₁, H₂, . . . , H_(t′)∈         with {H₁, H₂, . . . , H_(t′)} non-degenerate, it holds that:

$\left| {\overset{t^{\prime}}{\bigcap\limits_{\tau = 1}}H_{\tau}} \middle| {\neq {0\mspace{14mu}{mod}\mspace{14mu}{m.}}} \right.$

Proposition 13—Let l≥2 be an integer, and m=Π_(i=1) ^(r)p_(i) ^(α) ^(i) be a positive integer with r>1 different prime divisors such that ∀i∈{1, . . . ,r}:p_(i)>l. Suppose there exists an integer t≥2 and a uniform set-system

satisfying the conditions:

-   -   1. ∀G∈         :|G|=0 mod m,     -   2. ∀t′ such that 2≤t′≤t, and for all distinct G₁, G₂, . . . ,         G_(t′)∈         , it holds that:

${\left| {\overset{t^{\prime}}{\bigcap\limits_{\tau = 1}}G_{\tau}} \right| = {\mu\mspace{14mu}{mod}\mspace{14mu} m}},$

-   -   where μ≠0 mod m and ∀i∈{1, . . . ,r}:μ∈{0,1} mod p_(i),     -   3. |         G|≠0 mod m.

Then there exists a set-system

, that is explicitly constructible from the set-system

such that: [label=( )]

-   -   1. ∀H₁, H₂∈         , either |H₁|=|H₂|, |H₁|=l|H₂| or l|H₁|=|H₂|,     -   2.         has t-wise restricted intersections modulo m (see Definition         12).     -   Proof Starting with l uniform (i.e., all member sets have equal         size) set systems         ₁,         ₂, . . . ,         _(l) satisfying the following properties:     -   1. ∀H^((i))∈         _(i):|H^((i))|=0 mod m,     -   2. ∀t′ such that 2≤t′≤t, and for all distinct H₁ ^((i)), H₂         ^((i)), . . . , H_(t′) ^((i))∈         _(i), it holds that:

$\begin{matrix} {{\left| {\overset{t^{\prime}}{\bigcap\limits_{\tau = 1}}H_{\tau}^{(i)}} \right| = {\mu\mspace{14mu}{mod}\mspace{14mu} m}},} & \; \end{matrix}$

-   -   where μ≠0 mod m and ∀z∈{1, . . . ,r}:μ∈{0,1}mod p_(z),     -   3. ∀i∈{1, . . . ,l}:|         H^((i))|≠0 mod m,     -   4. |H^((i))|=|H^((j))| for all H(i)∈         _(i), H^((j))∈         _(j),     -   5. ∀i,j∈{1, . . . ,l}:|         H^((i))|=|         H^((j))|.

The following bijection is fixed:

$\begin{matrix} {{f_{i,j}:\left. {\bigcap\limits_{H^{(i)}{\epsilon\mathcal{H}}_{i}}H^{(i)}}\rightarrow{\bigcap\limits_{H^{(j)}{\epsilon\mathcal{H}}_{j}}H^{(j)}} \right.},} & \; \end{matrix}$

such that ƒ_(i,i) is the identity and ƒ_(i,j)∘f_(j,k)=f_(i,k) for all 1≤i,j,k≤l. Using these bijections, the sets

H^((i)) and

H^((j)) are identified with each other. Let:

$\begin{matrix} {A = {{\bigcap\limits_{H^{(1)}{\epsilon\mathcal{H}}_{1}}H^{(1)}} = {{{{\bigcap\limits_{H^{(2)}{\epsilon\mathcal{H}}_{2}}H^{(2)}}\operatorname{=.}}\;.\;.} = {\bigcap\limits_{H^{(l)}{\epsilon\mathcal{H}}_{l}}{H^{(l)}.}}}}} & \; \end{matrix}$

The elements of the sets in

_(i) are treated as being distinct from the elements of the sets in

_(j), except for the above identification of elements in

H^((i)) with elements in

H^((j)). Let a=|A|, and let β₁, β₂, . . . , β_(l−1)a) be elements that are distinct from all the elements in the sets in

₁,

₂, . . .

₁. Define the following set:

B={β₁,β₂, . . . ,β_(l−1)a)},

and consider a set system

for which the following two conditions hold:

-   -   for some i∈[l]:H^((i))∈         , where H^((i))∈         _(i),     -   (∪_(i=1) ^(l)H^((i))∪B)∈         , where H^((i))∈         _(i).

The common size of the sets in the uniform set systems

_(i) (1≤i≤l) are written as km for some k>0. Then, the following holds for all H^((i))∈

_(i),

$\begin{matrix} {{\left| {{\underset{i = 1}{\bigcup\limits^{l}}H^{(i)}}\bigcup B} \right| = {\left| {\underset{i = 1}{\bigcup\limits^{l}}H^{(i)}} \middle| {+ |B|} \right. = {{\sum\limits_{i = 1}^{l}\left| H^{(i)} \middle| {- \left( {l - 1} \right)} \middle| A \middle| {+ |B|} \right.} = {{{l\left( {km} \right)} - {\left( {l - 1} \right)a} + {\left( {l - 1} \right)a}} = {lkm}}}}},} & \; \end{matrix}$

where the second equality comes from the fact that H^((i))∩H^((j))=A for all i≠j. This proves that Condition 13 holds. Moving on to the Condition 13: let t₁, t₂, . . . , t_(i+1)≥0 be such that 2≤t′(=t₁+t₂+ . . . +t_(l+1))≤t. We shall consider the intersection of the sets:

-   -   H_(τ) ^((i)) where 1≤i≤l, 1≤τ≤t_(i) and H_(τ) ^((i))∈         _(i),     -   ∪_(i=1) ^(l) H′^((i)) _(τ)∪B where 1≤τ≤t_(l+1) and H′^((i))         _(τ)∈         _(i).

Assume that these sets form a non-degenerate family. Let:

${\sigma = {{{{\overset{l}{\bigcap\limits_{i = 1}}{\overset{t_{i}}{\bigcap\limits_{\tau = 1}}H_{\tau}^{(i)}}}\bigcap{\bigcap\limits_{\tau = 1}^{t_{l + 1}}\left( {H_{\tau}^{\prime{(1)}}\bigcup H_{\tau}^{\prime{(2)}}\bigcup\;{.\;.\;.\;{\bigcup H_{\tau}^{\prime{(l)}}}}\bigcup B} \right)}}} = {{{{\overset{l}{\bigcap\limits_{i = 1}}{\overset{t_{i}}{\bigcap\limits_{\tau = 1}}H_{\tau}^{(i)}}}\bigcap{\bigcap\limits_{\tau = 1}^{t_{l + 1}}\left( {H_{\tau}^{\prime{(1)}}\bigcup H_{\tau}^{\prime{(2)}}\bigcup\;{.\;.\;.\;{\bigcup H_{\tau}^{\prime{(l)}}}}} \right)}}} + {\epsilon{B}}}}},$

where ∈=1 if t₁=t₂= . . . =t_(l)=0, and ∈=0 otherwise. If two or more of t₁, t₂, . . . , t_(l) are non-zero, then: σ=|A|=a≠0 mod m. On the other hand, if exactly one of t₁, t₂, . . . , t_(l) is non-zero, then:

$\begin{matrix} {\sigma = \left| {{\overset{t_{i}}{\bigcap\limits_{\tau = 1}}H_{\tau}^{(i)}}\bigcap{\overset{t_{l + 1}}{\bigcap\limits_{\tau = 1}}H_{\tau}^{\prime{(i)}}}} \middle| {\neq {0\mspace{14mu}{mod}\mspace{14mu}{m.}}} \right.} & \; \end{matrix}$

Since H_(τ) ^((i)) (for 1≤τ≤t₁) and t_(i)) (for 1≤τ≤t_(l+1)) are not all the same by the assumption of non-degeneracy. If t₁=t₂= . . . =t_(l)=0, then we get:

$\begin{matrix} {{\sigma = {\left| {\underset{\tau = 1}{\bigcap\limits^{t_{l + 1}}}\left( {{H_{\tau}^{\prime}}^{(1)}\bigcup{H_{\tau}^{\prime}}^{(2)}\bigcup\;{.\;.\;.\mspace{11mu}{\bigcup H_{\tau}^{\prime{(l)}}}}} \right)} \middle| {+ {B}} \right. = {{\sum\limits_{i = 1}^{l}\left| {\underset{\tau = 1}{\bigcup\limits^{t_{i + 1}}}H_{\tau}^{\prime{(i)}}} \middle| {{{- \left( {l - 1} \right)}{A}} + {B}} \right.} = {\sum\limits_{i = 1}^{l^{\prime}}{\mu_{i}\mspace{14mu}{mod}\mspace{14mu} m}}}}},} & \; \end{matrix}$

for some integer l′ such that 1≤l′≤l, and some set {μ_(i)}_(i=1) ^(l′) such that for each μ_(i) and all primes p such that p|m, it holds that: μ_(i)∈{0,1}mod p. Since μ_(i)≠0 mod m for all 1≤i≤l′, there must be some prime factor p of m for which at least one of the μ_(i)'s satisfy μ_(i)=1 mod p. Since p is a prime factor of m, it satisfies: p>l≥l′. Hence, for p, we get:

$\sigma = {{\sum\limits_{i = 1}^{l^{\prime}}\mu_{i}} \neq {0\mspace{14mu}{mod}\mspace{14mu}{p.}}}$

This proves Condition 13, and hence completes the proof.

Remark—Suppose that |

|=s and that the number of elements in the universe of

is g. Then, there are ls sets of size km and s^(l) sets of size lkm in

. Therefore, we get: |

|=s^(l)+ls. The universe of

has lg elements, and for each H∈

, exactly one of the following is true:

-   -   H is a proper subset of exactly s^(l−1) sets and not a proper         superset of any sets in         ,     -   H is a proper superset of exactly l sets and not a proper subset         of any sets in         .

In order to explicitly construct set systems which, in addition to having the properties in Proposition 13, have sizes superpolynomial in the number of elements, the following is used to construct a superpolynomial uniform set-system.

Theorem 14—Let {α_(i)}_(i=1) ^(r) be r>1 positive integers and m=Π_(i=1) ^(r)p_(i) ^(α) ^(i) be a positive integer with r different prime divisors: p₁, . . . , p_(r). For every integer n≥1, there exists an explicitly constructible polynomial P in n variables such that

-   -   1. P(0, 0, . . . , 0)=0 mod m,     -   2. P(x)≠0 mod m for all x∈{0,1}^(n) such that x≠(0, 0, . . . ,         0),     -   3. ∀i∈[r] and ∀x∈{0,1}^(n) such that x≠(0, 0, . . . , 0), it         holds that: P(x)∈{0,1}mod p_(i).

The polynomial P has degree d=max(p₁ ^(e) ¹ , . . . ,p_(r) ^(e) ^(r) )−1 where e_(i) (∀i∈[r]) is the smallest integer that satisfies p_(i) ^(e) ^(i) >┌n^(1/r)┐. Define Q(x₁, x₂, . . . , x_(n))=P(1−x₁, 1−x₂, . . . , 1−x_(n)). Then:

-   -   1. Q(1, 1, . . . , 1)=0 mod m,     -   2. Q(x)≠0 mod m for all x∈{0,1}^(n) such that x≠(1, 1, . . . ,         1).     -   3. ∀i∈[r] and ∀x∈{0,1}^(n) such that x≠(1, 1, . . . , 1), it         holds that: Q(x)∈{0,1}mod p_(i).

Theorem 15—Let {α_(i)}_(i=1) ^(r) be r>1 positive integers and m=Π_(i=1) ^(r)p_(i) ^(α) ^(i) be a positive integer with r different prime divisors: p₁, . . . , p_(r). For every integer n≥1, there exists a uniform set system

over a universe of g elements which is explicitly constructible from the polynomial Q of degree d such that

-   -   1.

$g < \frac{2\left( {m - 1} \right)n^{2d}}{d!}$

if n≥2d,

-   -   2. |         |=n^(n),     -   3. ∀G∈         , |G|=0 mod m,     -   4. ∀G, H∈         such that G≠H, it holds that: |G∩H|=μ mod m, where μ≠0 mod m and         μ∈{0,1}mod p_(i) for all i∈[r],     -   5. |         G|≠0 mod m.

Note that Theorem 15 follows from the fact that the following holds in Grolmusz's construction of superpolynomial set-systems:

$\left| {\bigcap\limits_{G\epsilon\mathcal{G}}G} \right| = {{Q\left( {0,0,{.\;.\;.}\;,\; 0} \right)} \neq {0\mspace{14mu}{mod}\mspace{14mu}{m.}}}$

Theorem 16—Let {α_(i)}_(i=1) ^(r) be r>1 positive integers and m=Π_(i=1) ^(r)p_(i) ^(α) ^(i) be a positive integer with r different prime divisors: p₁, . . . , p_(r). For all integers t≥2 and n≥1, there exists a uniform set system

over a universe of g elements which is explicitly constructible from the polynomial Q of degree d such that

-   -   1.

${g < {\frac{2\left( {m - 1} \right)n^{2d}}{d!}\mspace{14mu}{if}\mspace{14mu} n} \geq {2d}},$

-   -   2. |         |=n^(n),     -   3. ∀G∈         , |G|=0 mod m,     -   4. ∀t′ such that 2≤t′≤t, and for all distinct G₁, G₂, . . . ,         G_(t′)∈         , it holds that:

${\left| {\overset{t^{\prime}}{\bigcap\limits_{\tau = 1}}G_{\tau}} \right| = {\mu\mspace{14mu}{mod}\mspace{14mu} m}},$

where μ≠0 mod m and μ∈{0,1}mod p_(i) for all i∈[r],

-   -   5. |         G|≠0 mod m.

Proof: Write the polynomial Q as

${Q\left( {x_{1},x_{2},{.\;.\;.}\;,x_{n}} \right)} = {\sum\limits_{i_{1} < i_{2} < \;{.\;.\;.}\; < i_{l}}{a_{i_{1},i_{2},\;{.\;.\;.}\;,i_{l}}x_{i_{1}}{x_{i_{2}}\;.\;.\;.\; x_{i_{l}}}}}$

Define

${\overset{\sim}{Q}\left( {x_{1},x_{2},{.\;.\;.}\;,x_{n}} \right)} = {\sum\limits_{i_{1} < i_{2} < \;{.\;.\;.}\; < i_{l}}{{\overset{\sim}{a}}_{i_{1},i_{2},\;{.\;.\;.}\;,\; i_{l}}x_{i_{1}}{x_{i_{2}}.\;.\;.\; x_{i_{l}}}}}$

where ã_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) it is the remainder when a_(i) ₁ _(,i) ₂ _(, . . . , i) _(l) it is divided by m.

Let [0, n−1]={0, 1, . . . , n−1}. Define the function δ: [0, n−1]^(t)→{0,1} as

${\delta\left( {u_{1},u_{2},{.\;.\;.}\;,u_{t}} \right)} = \left\{ \begin{matrix} 1 & {{{{if}\mspace{14mu} u_{1}} = {{{u_{2}\operatorname{=.}}\;.\;.} = u_{t}}},} \\ 0 & {{otherwise}.} \end{matrix} \right.$

For y₁, y₂, . . . , y_(t)∈[0, n−1]^(n), let

$a^{y_{1},y_{2},\;{.\;.\;.}\;,\; y_{t}} = {{\overset{\sim}{Q}\left( {{\delta\left( {y_{1,1},y_{2,1},{.\;.\;.}\;,y_{t,1}} \right)},{.\;.\;.}\;,{\delta\left( {y_{1,n},y_{2,n},\;{.\;.\;.}\;,y_{t,n}} \right)}} \right)}\mspace{14mu}{mod}\mspace{14mu}{m.{Then}}}$ a^(y₁, y₂, . . . , y_(t)) = ∑b_(i₁, i₂, . . . , i_(l))^(y₁, y₂, . . . , y_(t)) where $b_{i_{1},i_{2},\;{.\;.\;.}\;,i_{l}}^{y_{1},y_{2},\;{.\;.\;.}\;,y_{t}} = {\prod\limits_{j = 1}^{l}{{\delta\left( {y_{1,i_{j}},y_{2,i_{j}},{.\;.\;.}\;,y_{t,i_{j}}} \right)}.}}$

Each summand b_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) ^(y) ¹ ^(,y) ² ^(, . . . ,y) ^(t) corresponds to a monomial of {tilde over (Q)} and occurs with multiplicity ã_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) it in the above sum.

It can be checked that there exists partitions

_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) of [0, n−1]^(n) such that for all y₁, y₂, . . . , y_(t)∈[0, n−1]^(n),

$b_{i_{1},i_{2},\;{.\;.\;.}\;,i_{l}}^{y_{1},y_{2},\;{.\;.\;.}\;,\; y_{t}} = \left\{ \begin{matrix} 1 & {{{if}\mspace{14mu} y_{1}},y_{2},{.\;.\;.}\;,y_{t}} \\ 0 & {{otherwise},} \end{matrix} \right.$

belong to the same block of

_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) , and that the equivalence classes defined by the partition

_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) each has size n^(n-l). We say that a block in the partition

_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) covers y∈[0, n−1]^(n) if y is an element of the block.

A set system

is defined as follows: the sets in

correspond to y for y∈[0, n−1]^(n), and the set corresponding to y has elements given by the blocks that cover y.

The set y in the set system

has size equal to the number of blocks that cover y, which is equal to

a^(y,y, . . . ,y)={tilde over (Q)}(1,1, . . . ,1)=0 mod m.

For any 2≤t′≤t, and y₁, y₂, . . . , y_(t′)∈[0, n−1]^(n) distinct, some block of

_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) covers all of y₁, y₂, . . . , y_(t′) if and only if b_(i) ₁ _(, i) ₂ _(, . . . ,i) _(l) ^(y) ¹ ^(,y) ² ^(, . . . ,y) ^(t′) ^(, . . . ,y) ^(t′) =1 (note that y_(t′) occurs in the superscript t−t′+1 times). Hence, the number of such blocks is equal to:

a^(y) ¹ ^(,y) ² ^(, . . . ,y) ^(t′) ^(, . . . ,y) ^(t′) ≠0 mod m.

Finally, a bound on g is the number of elements in the universe of

. This construction is equal to the number of blocks. Since the partition

_(i) ₁ _(,i) ₂ _(, . . . ,i) _(l) defines n^(l) equivalence classes, the number of blocks is given by

${g = {{\sum\limits_{i_{1} < i_{2} < {.\;.\;.} < i_{l}}{{\overset{\sim}{a}}_{i_{1},i_{2},\;{.\;.\;.}\;,\; i_{l}}n^{l}}} \leq {\sum\limits_{l = 0}^{d}{\begin{pmatrix} n \\ l \end{pmatrix}\left( {m - 1} \right)n^{l}}} < {\left( {m - 1} \right){\sum\limits_{l = 0}^{d}\frac{n^{2l}}{l!}}} < \frac{2\left( {m - 1} \right)n^{2d}}{d!}}},$

provided that n≥2d.

Theorem 17—Let {α_(i)}_(i=1) ^(r) be r>1 positive integers and m=Π_(i=1) ^(r)p_(i) ^(α) ^(i) be a positive integer with r different odd prime divisors: p₁, . . . , p_(r), and l≥2 be an integer such that l<min(p₁, . . . , p_(r)). Then, for all integers t≥2 and n≥1, there exists an explicitly constructible non-uniform set-system

, defined over a universe of h elements, such that

-   -   1.

${h < {2{l\left( {m - 1} \right)}n^{4mn^{\frac{1}{r}}}\mspace{14mu}{if}\mspace{14mu} n} \geq \left( {4m} \right)^{1 + \frac{1}{r - 1}}},$

-   -   2. |         |=n^(ln)+ln^(n),     -   3. ∀H₁, H₂∈         , either |H₁|=|H₂|, |H₁|=l|H₂| or l|H₁|=|H₂|,     -   4.         has t-wise restricted intersections modulo m.

Proof By Theorem 16, there exists a uniform set-system

that satisfies conditions 1-3 of Proposition 13, and is defined over a universe of g elements, such that |

|=n^(n). Furthermore, we know that

$g < \frac{2\left( {m - 1} \right)n^{2d}}{d!}$

provided the condition n≥2d is satisfied. From Theorem 14, d=max(p₁ ^(e) ¹ , . . . ,p_(r) ^(e) ^(r) )−1 where e_(i) is the smallest integer that satisfies p_(i) ^(e) ^(i) >┌n^(1/r)┐, from which we obtain the following inequality:

d<max(p ₁ , . . . ,p _(r))┌n ^(1/r)┐<2mn ^(1/r).

Hence if

${n \geq \left( {4m} \right)^{1 + \frac{1}{r - 1}}},{{{then}\mspace{14mu} n^{\frac{r - 1}{r}}} \geq {4mn} \geq {4mn^{1/r}} > {2d}},$

and thus we have:

$g < \frac{2\left( {m - 1} \right)n^{2d}}{d!} < {2\left( {m - 1} \right)n^{2d}} < {2\left( {m - 1} \right){n^{4mn^{\frac{1}{r}}}.}}$

Applying Proposition 13 with the set-system

, a set-system

is obtained that satisfies Conditions 3 and 4. The size of

is:

|

|=(n ^(n))^(l) +l(n ^(n))=n ^(ln) +ln ^(n),

and the number of elements in the universe of

is

$h = {\lg < {2{l\left( {m - 1} \right)}n^{4mn^{\frac{1}{r}}}\mspace{14mu}{for}\mspace{14mu} n} \geq {\left( {4m} \right)^{1 + \frac{1}{r - 1}}.}}$

Corollary 18—Let {α_(i)}_(i=1) ^(r) be r>1 positive integers and m=Π_(i=1) ^(r)p_(i) ^(α) ^(i) be a positive integer with r different odd prime divisors: p₁, . . . , p_(r), and l≥2 be an integer such that l<min(p₁, . . . , p_(r)). Then, there exists c>0 such that for all integers t≥2 and h≥lm, there exists an explicitly constructible non-uniform¹ set-system

, defined over a universe of h elements, such that ¹ member sets do not all have equal size

-   -   1.

$\left| \mathcal{H} \middle| {> {{\exp\left( {c\frac{{l\left( {\log h} \right)}^{r}}{\left( {\log\log h} \right)^{r - 1}}} \right)} + {l\;{\exp\left( {c\frac{\left( {\log h} \right)^{r}}{\left( {\log\log h} \right)^{r - 1}}} \right)}}}} \right.,$

-   -   2. ∀H∈         :|H|=0 mod m,     -   3. ∀H₁, H₂∈         , either |H₁|=|H₂|, |H₁|=l|H₂| or l|H₁|=|H₂|,     -   4. ∀H₁, H₂∈         , where H₁≠H₂: if H₂⊂H₁ or H₁⊂H₂, then |H₁∩H₂|=0 mod m,     -   else |H₁∩H₂|≠0 mod m,     -   5.         has t-wise restricted intersections modulo m.

Proof. For small values of h, we can simply take

to be the set system

={{1,2, . . . ,m}, {m,m+1, . . . ,2m−1}, {1,2,3, . . . ,lm}},

so it is enough to prove the statement for sufficiently large h. Choose n as large as possible subject to the restriction

${2{l\left( {m - 1} \right)}n^{4mn^{\frac{1}{r}}}} \leq h$

It is assumed that h is sufficiently large so that the condition

$n \geq \left( {4m} \right)^{1 + \frac{1}{r - 1}}$

is satisfied. For or N=n+1, it holds that:

${h < {2{l\left( {m - 1} \right)}N^{4mN^{\frac{1}{r}}}N} > e^{r{W_{0}{({\frac{1}{4rm}\log\frac{h}{2{l{({m - 1})}}}})}}}},$

where W₀ is the principal branch of the Lambert W function. Fix any c₁ such that

$0 < c_{1} < {\frac{1}{4rm}.}$

Then, for h sufficiently large, n>e^(rW) ⁰ ^((c) ¹ ^(log h)) and:

W ₀(x)=log x−log log x+o(1),

hence, it follows that there exists some c₂ such that for all sufficiently large h, it holds that:

${n > {\exp\left( {{r\log\log h} - {r\log\log\log h} + c_{2}} \right)}} = {\frac{{e^{c_{2}}\left( {\log h} \right)}^{r}}{\left( {\log\log h} \right)^{r}}.}$

This shows that there exists c₃>0 such that for sufficiently large h, we get:

$\begin{matrix} {n^{n} > {{\exp\left( \frac{{c_{3}\left( {\log h} \right)}^{r}}{\left( {\log\log h} \right)^{r - 1}} \right)}.}} & (1) \end{matrix}$

Since the size of

is |

|=n^(ln)+ln^(n), it follows from Equation 1 that:

$\left| \mathcal{H} \middle| {> {{\exp\left( {c\frac{{l\left( {\log h} \right)}^{r}}{\left( {\log\log h} \right)^{r - 1}}} \right)} + {{l\exp}\left( {c\frac{\left( {\log h} \right)^{r}}{\left( {\log\log h} \right)^{r - 1}}} \right)}}} \right.$

From the set system

, a covering vector family

follows.

Definition 19 (Covering Vectors)—Let m, h>0 be positive integers, S⊆

_(m)\{0}, and w(⋅) and

⋅,⋅

denote Hamming weight and inner product, respectively. We say that a subset

={v_(i)}_(i=1) ^(N) of vectors in (

_(m))^(h) forms an S-covering family of vectors if the following two conditions are satisfied:

-   -   ∀i∈[N], it holds that:         v_(i),v_(i)         =0 mod m,     -   ∀i,j∈[N], where i≠j, it holds that:

${\left\langle {v_{i},v_{j}} \right\rangle{mod}\mspace{14mu} m} = \left\{ \begin{matrix} 0 & {{{if}\mspace{14mu}{w\left( {{v_{i} \circ v_{j}}\mspace{14mu}{mod}\mspace{14mu} m} \right)}} = {0\mspace{14mu}{mod}\mspace{14mu} m}} \\ {\in S} & {{otherwise},} \end{matrix} \right.$

where ∘ denotes Hadamard/Schur product (see Definition 1).

Recall that h, m, l are positive integers such that 2≤l<min(p₁, . . . . , p_(r)) and m=Π_(i=1) ^(r)p_(i) ^(α) ^(i) has r>1 different prime divisors: p₁, . . . , p_(r). Further, it follows that the sizes of the pairwise intersections of the sets in

occupy at most m−1 residue classes modulo m. If each set H_(i)∈

is represented by a representative vector v_(i)∈(

_(m))^(h), then for the resulting subset

of vectors in (

_(m))^(h), the following result follows from Corollary 18.

Corollary 20—For the set-system

defined in Corollary 18, if each set H_(i)∈

is represented by a unique vector v_(i)∈(

_(m))^(h), then for a set S of size m−1, the set of vectors

={v_(i)}_(i=1) ^(N), formed by the representative vectors of all sets in

, forms an S-covering family such that

$N > {{\exp\left( {c\frac{{l\left( {\log\mspace{14mu} h} \right)}^{r}}{\left( {\log\mspace{14mu}\log\mspace{14mu} h} \right)^{r - 1}}} \right)} + {{{lex}p}\left( {c\frac{\left( {\log\mspace{14mu} h} \right)^{r}}{\left( {\log\mspace{14mu}\log\mspace{14mu} h} \right)^{r - 1}}} \right)}}$

and ∀i,j∈[N] it holds that

v_(i),v_(j)

=|H_(i)∩H_(j)|mod m.

Vector families and special inner products can be used to work with sets from different set-systems. The following two properties hold for all sets in any set-system

that is defined by Corollary 18.

-   -   H is a proper subset of exactly s^(l−1) sets and not a proper         superset of any sets in         ,     -   H is a proper superset of exactly l sets and not a proper subset         of any sets in         ,

${{where}\mspace{14mu} s} \geq {{\exp\left( {c\frac{\left( {\log h} \right)^{r}}{\left( {\log\log h} \right)^{r - 1}}} \right)}.}$

Let

⊆(

_(m))^(h) be a family of covering vectors, consisting of representative vectors for the sets in a set-system

(defined modulo m). For all i∈|

|(=|

|), let v_(i)∈

denote the representative vector for the set H_(i)∈

. Recall from Corollary 20 that the following holds:

v _(i) ,v _(j)

=|H _(i) ∩H _(j)|mod m.

A k-multilinear form on

^(k) is defined as:

$\left\langle {v_{1},v_{2},{.\;.\;.}\;,v_{k}} \right\rangle_{k} = {{\sum\limits_{i = 1}^{h}{{v_{1}\lbrack i\rbrack}{{v_{2}\lbrack i\rbrack}\;.\;.\;.\;{v_{k}\lbrack i\rbrack}}}} = \left| {\overset{k}{\bigcap\limits_{i = 1}}H_{i}} \middle| . \right.}$

A representative vector v∈

is defined for a fixed set H∈

. For the rest of the sets H_(i)∈

, their respective representative vectors are denoted by v_(i)∈

. Let v, v₁, v₂∈

, and v_(i∪j)∈

denote the representative vector for the set H_(i∪j)=H_(i)∪H_(j). Then, the following holds:

$\begin{matrix} \begin{matrix} {\left\langle {v,v_{1\bigcup 2}} \right\rangle = {\left| {H\bigcap\left( {H_{1}\bigcup H_{2}} \right)} \right| = \left| {\left( {H\bigcap H_{1}} \right)\bigcup\left( {H\bigcap H_{2}} \right)} \right|}} \\ {= \left| {H\bigcap H_{1}} \middle| {+ \left| {H\bigcap H_{2}} \middle| {- \left| {H\bigcap H_{1}\bigcap H_{2}} \right|} \right.} \right.} \\ {= {\left\langle {v,v_{1}} \right\rangle + \left\langle {v,v_{2}} \right\rangle - {\left\langle {v,v_{1},v_{2}} \right\rangle_{3}.}}} \end{matrix} & (2) \end{matrix}$

Define F as:

F(x,y,z)=x+y−z,

i.e., the following holds:

F(

v,v ₁

,

v,v ₂

,

v,v ₁ ,v ₂

₃)=

v,v _(1∪2)

.

Note that the following also holds:

$\begin{matrix} {\left| {H\bigcap\left( {H_{1}\bigcap H_{2}} \right)} \right| = {\left\langle {v,v_{1}} \right\rangle + \left\langle {v,v_{2}} \right\rangle - \left\langle {v,v_{1\bigcup 2}} \right\rangle}} \\ {= \left| {H\bigcap H_{1}} \middle| {+ \left| {H\bigcap H_{2}} \middle| {- \left| {H\bigcap\left( {H_{1}\bigcup H_{2}} \right)} \middle| . \right.} \right.} \right.} \end{matrix}$

Consider the following simple extension of Equation 2:

$\begin{matrix} {\left\langle {v,v_{1},v_{2\bigcup 3}} \right\rangle_{3} = {\left| {H\bigcap H_{1}\bigcap\left( {H_{2}\bigcup H_{3}} \right)} \right| =}} \\ {\left| {\left( {H\bigcap H_{1}\bigcap H_{2}} \right)\bigcup\left( {H\bigcap H_{1}\bigcap H_{3}} \right)} \right|} \\ {= \left| {H\bigcap H_{1}\bigcap H_{2}} \middle| {+ \left| {H\bigcap H_{1}\bigcap H_{3}} \middle| {- \left| {H\bigcap H_{1}\bigcap H_{2}\bigcap H_{3}} \right|} \right.} \right.} \\ {= {\left\langle {v,v_{1},v_{2}} \right\rangle_{3} + \left\langle {v,v_{1},v_{3}} \right\rangle_{3} - {\left\langle {v,v_{1},v_{2},v_{3}} \right\rangle_{4}.}}} \end{matrix}$

The extension yields:

F(

v,v ₁,v₂

₃ ,

v,v ₁ ,v ₃

₃ ,

v,v ₁ ,v ₂ ,v ₃

₄)=(v,v ₁ ,v _(2∪3))₃.

Note that the following also holds:

$\begin{matrix} {{\left. {H\bigcap\left( {H_{1}\bigcap H_{2}\bigcap H_{3}} \right)} \right| = {\left\langle {v,v_{1},v_{2}} \right\rangle_{3} + \left\langle {v,v_{1},v_{3}} \right\rangle_{3} - \left\langle {v,v_{1},v_{1\bigcup 2}} \right\rangle_{4}}}} \\ {= \left| {H\bigcap H_{1}\bigcap H_{2}} \middle| {+ \left| {H\bigcap H_{1}\bigcap H_{3}} \middle| - \right.} \right.} \\ {\left| {H\bigcap H_{1}\bigcap\left( {H_{2}\bigcup H_{3}} \right)} \middle| . \right.} \end{matrix}$

It follows by extension that

v, v_(1∪2∪ . . . ∪w)

_(w), can be computed from the k-multilinear forms

v₁, v₂, . . . , v_(k)

_(k), for all k∈[w+1] and all v_(i)∈

. Hence,

v _(i) ,v _(j)

=|H _(i) ∩H _(j)|mod m

allows computation of the intersection of any sets H_(i), H_(j)∈

, such that two vectors v_(i), v_(j) of a covering vector family

of the set-system

represent two sets H_(i), H_(j) of the set-system

and have an inner product

v_(i), v_(j)

equal to a multiple of a non-prime integer m when the size of the intersection (|H_(i)∩H_(j)|) of the sets H_(i), H_(j) represented by the two vectors v_(i), v_(j) is a multiple of the non-prime integer m. Further, being able to compute the aforementioned function F(x, y, z) allows computation of unions and intersections of any arbitrary number of sets from

.

An example fully homomorphic encryption system is supported by the foregoing description and drawings, and by the following. The example fully homomorphic encryption system supports both addition operations and multiplication operations of operation-compatible ciphertext. Each ciphertext is designated as “addition compatible” or “multiplication compatible,” designations that are mutually incompatible. Hence, an aggregator (the operation and/or entity responsible for homomorphic evaluation of the arithmetic circuit) performs a “gate conversion” between addition compatible ciphertext and multiplication compatible ciphertext. It is assumed that all parties are honest. In one implementation, all matrices are square.

Based on the foregoing, for H∈

, if an addition or multiplication gate receives sets H_(a) and H_(b) (1≤a, b≤|

|) as inputs, then the output is zero if:

-   -   H_(a)=H_(b), or     -   H_(a) is a proper subset of H_(b) or vice-versa.         Accordingly, if these sets are carefully placed within the         various terms, then the sets can be used to remove the error         terms to which they are attached. Therefore, the set-systems         cancel each other and therefore result in the errors also being         canceled after a fixed depth in the evaluation circuit.

A trust vector v

is sampled from the covering vector family

(a family of representative trust vectors) such that the set H∈

represented by v has s^(i−1) proper supersets in

. Recall that s is superpolynomial w.r.t. h and r. An error E is randomly sampled from a cyclic generator set ℑ for module M, which is used to define the CLWE distribution. Party P_(b (b∈{)0,1}) is provided with {E, A₀, A, x_(b)}, where x_(b)=

v, v_(b)

for some v_(b)∈

such that H_(b)

H and H

H_(b). The matrices “A₀, A” are referred to as “level-specific matrices”, the vectors v and v_(b) are trust vectors, and the term “x” is referred to as an “error canceling variable” or an “error canceling party identifier.” An integer q is selected such that m=lφ(q) and l²φ(q)=q.

Party P_(b) encrypts its plaintext S_(b)∈ℑ and generates addition compatible ciphertext as: C_(a) ^((b))=AS_(b)+

v,v_(b)

E mod q. Party P₀ generates multiplication compatible ciphertext C_(d) ⁽⁰⁾ as: C_(d) ⁽⁰⁾A₀=AS₀+

mod q, and party P₁ generates its multiplication compatible ciphertext as: C_(d) ⁽⁰⁾A=A₀S₁+

mod q. C_(d) ^((b)) can be computed via lattice trapdoors. Vectors may be selected from a covering vector family of the set-system, such that the inner product of the vectors equals a multiple of a non-prime integer when the size of the intersection of the sets represented by the two vectors is a multiple of the non-prime integer.

Each level in the circuit has one matrix assigned to it. A is the level 0 matrix. The matrices for all other levels alternate between A and A₀. Addition of any two addition compatible ciphertexts is straightforward via simple addition, yielding a result that depends upon the choice of v₀ and v₁. Multiplication of two compatible ciphertexts can be performed as:

$\begin{matrix} \begin{matrix} {{C_{d}^{(1)}C_{d}^{(0)}A_{0}} = {{C_{d}^{(1)}\left( {{AS_{0}} + E^{\langle{v,v_{0}}\rangle}} \right)}{mod}\mspace{14mu} q}} \\ {= {{C_{d}^{(1)}AS_{0}} + {C_{d}^{(1)}E^{\langle{v,v_{0}}\rangle}{mod}\mspace{14mu} q}}} \\ {= {{A_{0}S_{1}S_{0}} + {E^{\langle{v,v_{1}}\rangle}S_{0}} + {C_{d}^{(1)}E^{\langle{v,v_{0}}\rangle}{mod}\mspace{14mu}{q.}}}} \end{matrix} & \; \end{matrix}$

Since ℑ is cyclic, the “nature” of the errors remains preserved throughout the multiplication. If S₀=

for some randomly sampled v_(z)∈

, then the errors get reduced in the desired manner.

Each multiplication and addition operation can occur only between compatible ciphertexts. Since the matrices A₀ and A are different, ciphertexts at each level of the circuit are multiplication compatible. Hence, after level 0, the aggregator must perform “gate conversions”, i.e., transforming multiplication compatible ciphertext to addition compatible ciphertext. This can be easily carried out by performing component wise product of the multiplication compatible ciphertext with Â, where ÂA₀=A mod q. Converting addition compatible ciphertext to multiplication compatible cyphertext can be accomplished by computing the component-wise product of the appropriate short matrix.

The set-system

can also provide support for general access structures in which parties do not rely on shared keys to carry out fully homomorphic encryption computations of ciphertext. Instead, general access structures allow for distributing shares of a secret such that any authorized subset of secret holders, as specified by the general access structure, can recompute the secret and therefore decrypt corresponding ciphertext. Such general access structures are monotone (e.g., if a subset of parties A belongs to the general access structure and if A is a subset of another set of parties B, then B also belongs to the general access structure, and hence is also authorized to recompute the secret).

It follows directly from the description of the vector families and special inner products provided herein that in a setting with more than two parties, x_(b) can be generated such that it holds for any authorized subset of parties

that the set represented by

v_(i) in

x_(i)=

v,v_(i)

, is always a superset of H∈

that is represented by v∈

. Similarly, x_(b) can be generated such that it holds for all unauthorized subsets

that the set represented by

v_(i) is never a superset (or subset) of v. In such a setting, errors get canceled if some authorized subset of parties collaborates, and errors do not get canceled if an unauthorized subset of parties collaborates. Accordingly, parties belonging to certain authorized subsets can successfully decrypt the ciphertext output of the evaluation circuit, and parties not belonging to these subsets cannot.

FIG. 2 illustrates an example flow 200 through a homomorphic evaluation circuit. As previously discussed, each multiplication and addition operation can occur only between compatible ciphertexts. Since the matrices A₀ and A are different, ciphertexts at each level of the circuit are multiplication compatible. Hence, after level 0, the aggregator must perform “gate conversions”, i.e., transforming multiplication compatible ciphertext to addition compatible ciphertext. This can be easily carried out by performing component wise product of the multiplication compatible ciphertext with Â, where ÂA₀=A mod q.

A multiplication compatible ciphertext 202 is received (e.g., as input to a homomorphic evaluation circuit or as an intermediate ciphertext result in the homomorphic evaluation circuit). The multiplication compatible ciphertext 202 is input to a multiplication gate 204 of the evaluation circuit, which outputs multiplication compatible ciphertext 206. Because the next arithmetic operation of the evaluation circuit is an addition gate 212, a gate conversion 208 transforms the multiplication compatible ciphertext 206 to addition compatible ciphertext 210, which is then inputted to the addition gate 212 for computation. Output of the addition gate 212 is passed to a subsequent level of the evaluation circuit or out of the evaluation circuit as a ciphertext result of the evaluation.

FIG. 3 illustrates example components used in a fully homomorphic encryption system 300. An encryption operator 302 receives plaintext input (not shown). A homomorphic encryptor 304 encrypts the plaintext input to yield a homomorphically encrypted ciphertext input, which is communicated to a homomorphic evaluation circuit 306 via a communication interface 308. For its encryption operation, the homomorphic encryptor 304 employs vectors selected from a covering vector family of a set-system having an intersection property for which the inner product of the vectors equals a multiple of a non-prime integer when the size of the intersection of the sets represented by the two vectors is a multiple of the non-prime integer.

The homomorphic evaluation circuit 306 receives the homomorphically encrypted ciphertext input via a communication interface 310. A homomorphic evaluator 312 evaluates the homomorphically encrypted ciphertext input against an arithmetic operation via addition and/or multiplication gates. The evaluation result is generated as homomorphically encrypted ciphertext output, which is communicated to the decryption operator 314 via the communication interface 310. The decryption operator 314 receives the homomorphically encrypted ciphertext output via a communication interface 316. A homomorphic descriptor 318 decrypts the homomorphically encrypted ciphertext output to yield plaintext output (not shown).

FIG. 4 illustrates example operations 400 for evaluating homomorphically encrypted ciphertext. An input operation 402 receives ciphertext input that has been homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property. An evaluation operation 404 evaluates an arithmetic function on the ciphertext input to generate a ciphertext output. The arithmetic function includes one or more additive gates and one or more multiplicative gates. The evaluation operation 404 also generates errors during the evaluation of the arithmetic function, but the intersection property of the set-system cancels out the errors during the evaluation operation 404. An output operation 406 transmits the ciphertext output for homomorphic decryption to generate a plaintext result.

The set-system may be selected that includes sets having an intersection property that cancels out the error during the evaluation, rather than by constraining the operation or performing supplemental error-removal operations. Vectors may be selected from a covering vector family of the set-system, such that the inner product of the vectors equals a multiple of a non-prime integer when the size of the intersection of the sets represented by the two vectors is a multiple of the non-prime integer (an example intersection property). The vectors may be used to homomorphic encrypt plaintext into ciphertext input for the evaluation. Errors generated during the evaluation are then canceled out based on the intersection properties of the set-system used to encrypt the ciphertext input. Also, based on the foregoing, given a level-specific matrix (A₀ or A) and its trapdoor, a ciphertext result (output) can be inverted to retrieve a plaintext result (output).

FIG. 5 illustrates example operations 500 for decrypting homomorphically encrypted ciphertext. It should be understood that encrypting homomorphically encrypted ciphertext may also be accomplished using the technology described herein.

A receiving operation 502 receives a ciphertext output of an arithmetic evaluation function. The arithmetic evaluation function has been performed on a ciphertext input homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property. A decrypting operation 504 decrypts the ciphertext output using a summation of two or more noise-canceling party identifiers of two or more authorized parties. The intersection property of the sets cancels out the errors for the two or more authorized parties during the decryption operation. A decryption attempt operation 506 attempts to decrypt the ciphertext output using a summation of one or more noise-canceling party identifiers of one or more unauthorized parties. However, as the intersection property of the sets fails to cancel out the errors for the one or more unauthorized parties during the attempted decryption, the attempted decryption operation fails for the one or more unauthorized parties.

FIG. 6 illustrates an example computing device 600 for implementing the features and operations of the described technology. The computing device 600 may embody a remote control device or a physical controlled device and is an example network-connected and/or network-capable device and may be a client device, such as a laptop, mobile device, desktop, tablet; a server/cloud device; an internet-of-things device; an electronic accessory; or another electronic device. The computing device 600 includes one or more hardware processor(s) 602 and a memory 604. The memory 604 generally includes both volatile memory (e.g., RAM) and nonvolatile memory (e.g., flash memory). An operating system 610 resides in the memory 604 and is executed by the hardware processor(s) 602.

In an example computing device 600, as shown in FIG. 6, one or more modules or segments, such as applications 650, a homomorphic evaluator, a homomorphic encryptor, a homomorphic decryptor, a communication interface, and other services, workloads, and modules, are loaded into the operating system 610 on the memory 604 and/or storage 620 and executed by hardware processor(s) 602. The storage 620 may include one or more tangible storage media devices and may store cryptographic security parameters, plain text, ciphertext, device parameters, and other data and may be local to the computing device 600 or may be remote and communicatively connected to the computing device 600.

The computing device 600 includes a power supply 616, which is powered by one or more batteries or other power sources and which provides power to other components of the computing device 600. The power supply 616 may also be connected to an external power source that overrides or recharges the built-in batteries or other power sources.

The computing device 600 may include one or more communication transceivers 630 that may be connected to one or more antenna(s) 632 to provide network connectivity (e.g., mobile phone network, Wi-Fi®, Bluetooth®) to one or more other servers and/or client devices (e.g., mobile devices, desktop computers, or laptop computers). The computing device 600 may further include a network adapter 636, which is a type of computing device. The computing device 600 may use the adapter and any other types of computing devices for establishing connections over a wide-area network (WAN) or local-area network (LAN). It should be appreciated that the network connections shown are exemplary and that other computing devices and means for establishing a communications link between the computing device 600 and other devices may be used.

The computing device 600 may include one or more input devices 634 such that a user may enter commands and information (e.g., a keyboard or mouse). These and other input devices may be coupled to the server by one or more interfaces 638, such as a serial port interface, parallel port, or universal serial bus (USB). The computing device 600 may further include a display 622, such as a touch screen display.

The computing device 600 may include a variety of tangible processor-readable storage media and intangible processor-readable communication signals. Tangible processor-readable storage can be embodied by any available media that can be accessed by the computing device 600 and includes both volatile and nonvolatile storage media, removable and non-removable storage media. Tangible processor-readable storage media excludes communications signals (e.g., signals per se) and includes volatile and nonvolatile, removable and non-removable storage media implemented in any method or technology for storage of information such as processor-readable instructions, data structures, program modules or other data. Tangible processor-readable storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CDROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other tangible medium which can be used to store the desired information and which can be accessed by the computing device 600. In contrast to tangible processor-readable storage media, intangible processor-readable communication signals may embody processor-readable instructions, data structures, program modules or other data resident in a modulated data signal, such as a carrier wave or other signal transport mechanism. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, intangible communication signals include signals traveling through wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media.

Various software components described herein are executable by one or more hardware processors, which may include logic machines configured to execute hardware or firmware instructions. For example, the processors may be configured to execute instructions that are part of one or more applications, services, programs, routines, libraries, objects, components, data structures, or other logical constructs. Such instructions may be implemented to perform a task, implement a data type, transform the state of one or more components, achieve a technical effect, or otherwise arrive at a desired result.

Aspects of processors and storage may be integrated together into one or more hardware logic components. Such hardware-logic components may include field-programmable gate arrays (FPGAs), program- and application-specific integrated circuits (PASIC/ASICs), program- and application-specific standard products (PS SP/AS SPs), system-on-a-chip (SOC), and complex programmable logic devices (CPLDs), for example.

The terms “module,” “program,” and “engine” may be used to describe an aspect of a remote control device and/or a physical controlled device 802 implemented to perform a particular function. It will be understood that different modules, programs, and/or engines may be instantiated from the same application, service, code block, object, library, routine, API, function, etc. Likewise, the same module, program, and/or engine may be instantiated by different applications, services, code blocks, objects, routines, APIs, functions, etc. The terms “module,” “program,” and “engine” may encompass individual or groups of executable files, data files, libraries, drivers, scripts, database records, etc.

It will be appreciated that a “service,” as used herein, is an application program executable across multiple user sessions. A service may be available to one or more system components, programs, and/or other services. In some implementations, a service may run on one or more server computing devices.

While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features specific to particular embodiments of particular described technology. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

Thus, particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous.

A number of implementations of the described technology have been described. Nevertheless, it will be understood that various modifications can be made without departing from the spirit and scope of the recited claims. 

What is claimed is:
 1. A computing-processor-implemented method comprising: receiving a ciphertext output of an arithmetic evaluation function, the arithmetic evaluation function being performed on a ciphertext input homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property; and decrypting the ciphertext output using a summation of two or more noise-canceling party identifiers of two or more authorized parties, wherein the intersection property of the sets cancels out errors generated during the decrypting operation for the two or more authorized parties.
 2. The computing-processor-implemented method of claim 1, further comprising: attempting to decrypt the ciphertext output using a summation of one or more noise-canceling party identifiers of one or more unauthorized parties, wherein the intersection property of the sets fails to cancel out errors generated during the attempted decryption and the attempted decryption operation fails for the one or more unauthorized parties.
 3. The computing-processor-implemented method of claim 1, wherein two vectors of a covering vector family of the set-system represent two sets of the set-system and have an inner product equal to a multiple of a non-prime integer when the size of the intersection of the sets represented by the two vectors is a multiple of the non-prime integer.
 4. The computing-processor-implemented method of claim 1, wherein the ciphertext output is generated to be decrypted using the set-system including the sets having the intersection property.
 5. The computing-processor-implemented method of claim 1, wherein each of the two or more noise-canceling party identifiers represents a summation of inner products of trust vectors corresponding to each of the two or more authorized parties.
 6. The computing-processor-implemented method of claim 1, wherein the decrypting operation generates a plaintext result of the arithmetic evaluation function performed on the ciphertext input.
 7. The computing-processor-implemented method of claim 1, wherein a set represented by a first summation of trust vectors of the two or more authorized parties is always a superset or subset of a set in the set-system and second summation of trust vectors of one or more unauthorized parties is never a superset or a subset of a set in the set-system.
 8. A system comprising: one or more hardware processors; a communication interface coupled to the one or more hardware processors and configured to receive a ciphertext output of an arithmetic evaluation function, the arithmetic evaluation function being performed on a ciphertext input homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property; and a decryptor executable by the one or more hardware processors and configured to decrypt the ciphertext output using a summation of two or more noise-canceling party identifiers of two or more authorized parties, wherein the intersection property of the sets cancels out errors generated during the decryption for the two or more authorized parties.
 9. The system of claim 8, wherein the decryptor is further configured to attempt decryption the ciphertext output using a summation of one or more noise-canceling party identifiers of one or more unauthorized parties, wherein the intersection property of the sets fails to cancel out the errors generated during the attempted decryption and the attempted decryption fails for the one or more unauthorized parties.
 10. The system of claim 8, wherein two vectors of a covering vector family of the set-system represent two sets of the set-system and have an inner product equal to a multiple of a non-prime integer when the size of the intersection of the sets represented by the two vectors is a multiple of the non-prime integer.
 11. The system of claim 8, wherein the ciphertext output is generated to be decrypted using the set-system including the sets having the intersection property.
 12. The system of claim 8, wherein each of the two or more noise-canceling party identifiers represents a summation of inner products of trust vectors corresponding to each of the two or more authorized parties.
 13. The system of claim 8, wherein the decryptor is further configured to generate a plaintext result of the arithmetic evaluation function performed on the ciphertext input.
 14. The system of claim 8, wherein a set represented by a first summation of trust vectors of the two or more authorized parties is always a superset or subset of a set in the set-system and second summation of trust vectors of one or more unauthorized parties is never a superset or a subset of a set in the set-system.
 15. One or more tangible processor-readable storage media embodied with instructions for executing on one or more processors and circuits of a computing device a process comprising: receiving a ciphertext output of an arithmetic evaluation function, the arithmetic evaluation function being performed on a ciphertext input homomorphically encrypted from a plaintext input using a set-system including sets having an intersection property; and decrypting the ciphertext output using a summation of two or more noise-canceling party identifiers of two or more authorized parties, wherein the intersection property of the sets cancels out errors generated during the decrypting operation for the two or more authorized parties.
 16. The one or more tangible processor-readable storage media of claim 15, wherein the process further comprises: attempting to decrypt the ciphertext output using a summation of one or more noise-canceling party identifiers of one or more unauthorized parties, wherein the intersection property of the sets fails to cancel out errors generated during the attempted decryption and the attempted decryption operation fails for the one or more unauthorized parties.
 17. The one or more tangible processor-readable storage media of claim 15, wherein two vectors of a covering vector family of the set-system represent two sets of the set-system and have an inner product equal to a multiple of a non-prime integer when the size of the intersection of the sets represented by the two vectors is a multiple of the non-prime integer.
 18. The one or more tangible processor-readable storage media of claim 15, wherein the ciphertext output is generated to be decrypted using the set-system including the sets having the intersection property.
 19. The one or more tangible processor-readable storage media of claim 15, wherein each of the two or more noise-canceling party identifiers represents a summation of inner products of trust vectors corresponding to each of the two or more authorized parties.
 20. The one or more tangible processor-readable storage media of claim 15, wherein a set represented by a first summation of trust vectors of the two or more authorized parties is always a superset or subset of a set in the set-system and second summation of trust vectors of one or more unauthorized parties is never a superset or a subset of a set in the set-system. 